Minimization of transformed $l_1$ penalty: Closed form representation and iterative thresholding algorithms
نویسندگان
چکیده
منابع مشابه
Minimization of Transformed L1 Penalty: Closed Form Representation and Iterative Thresholding Algorithms
The transformed l1 penalty (TL1) functions are a one parameter family of bilinear transformations composed with the absolute value function. When acting on vectors, the TL1 penalty interpolates l0 and l1 similar to lp norm (p ∈ (0, 1)). In our companion paper, we showed that TL1 is a robust sparsity promoting penalty in compressed sensing (CS) problems for a broad range of incoherent and cohere...
متن کاملTransformed Schatten-1 Iterative Thresholding Algorithms for Matrix Rank Minimization and Applications
We study a non-convex low-rank promoting penalty function, the transformed Schatten-1 (TS1), and its applications in matrix completion. The TS1 penalty, as a matrix quasi-norm defined on its singular values, interpolates the rank and the nuclear norm through a nonnegative parameter a∈ (0,+∞). We consider the unconstrained TS1 regularized low-rank matrix recovery problem and develop a fixed poin...
متن کاملMinimization of Transformed L_1 Penalty: Theory, Difference of Convex Function Algorithm, and Robust Application in Compressed Sensing
We study the minimization problem of a non-convex sparsity promoting penalty function, the transformed l1 (TL1), and its application in compressed sensing (CS). The TL1 penalty interpolates l0 and l1 norms through a nonnegative parameter a ∈ (0,+∞), similar to lp with p ∈ (0, 1]. TL1 is known in the statistics literature to enjoy three desired properties: unbiasedness, sparsity and Lipschitz co...
متن کاملMinimization of multi-penalty functionals by alternating iterative thresholding and optimal parameter choices
Inspired by several recent developments in regularization theory, optimization, and signal processing, we present and analyze a numerical approach to multipenalty regularization in spaces of sparsely represented functions. The sparsity prior is motivated by the largely expected geometrical/structured features of high-dimensional data, which may not be well-represented in the framework of typica...
متن کاملMinimization of Non-smooth, Non-convex Functionals by Iterative Thresholding
Numerical algorithms for a special class of non-smooth and non-convex minimization problems in infinite dimensional Hilbert spaces are considered. The functionals under consideration are the sum of a smooth and non-smooth functional, both possibly non-convex. We propose a generalization of the gradient projection method and analyze its convergence properties. For separable constraints in the se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Sciences
سال: 2017
ISSN: 1539-6746,1945-0796
DOI: 10.4310/cms.2017.v15.n2.a9